Proposal to ARTES Flexible Reliable Timing Constraints
نویسندگان
چکیده
منابع مشابه
Proposal for Extension of Project “Flexible Reliable Timing Constraints”
The project " Flexible Reliable Timing Constrains " has been approved by ARTES and started in February 2000. Academic partner is Prof. Krithi Ramamritham of University of Massachusetts/IIT Bomaby, industrial partner is MECEL AB, Gothenburg. Damir Isovic was hired as Ph.D. student. The initial phase has worked out well: two papers have been accepted at conferences, simulators for analysis work h...
متن کاملFlexible job shop scheduling under availability constraints
In this paper, an exact geometric algorithm is presented for solving two-job sequencing and scheduling problems in flexible flow shop and job shop environments while the resources are (un)available in some time periods and processors (un)availability is the same in all work centers. This study seems utterly new and it is applicable to any performance measure based on the completion time. The in...
متن کاملModeling of Holonic Manufacturing Control Systems Considering Reconfiguration and Timing Constraints
Automation and control systems(ACSs) must ensure the fulfillment of the current requirements in manufacturing systems, such as flexibility, distributed architecture, and agility in response to changes imposed by the market or the inevitable occurrence of faults. In this context, one solution to design ACSs is a combination of techniques such as holonic control system (HCS) and active fault-tole...
متن کاملDesign of a reliable supply chain network with responsiveness considerations under uncertainty: case study of an Iranian tire manufacturer
This paper proposes a bi-objective reliable supply chain network design that immunizes the network against different sources of uncertainties. In this regard, scenario based stochastic programming method is applied to model different disruption scenarios affecting accurate performance of network stages. Also, reliable and unreliable facilities are suggested for lessening vulnerability of networ...
متن کاملA Memetic Algorithm for Hybrid Flowshops with Flexible Machine Availability Constraints
This paper considers the problem of scheduling hybrid flowshops with machine availability constraints (MAC) to minimize makespan. The paper deals with a specific case of MAC caused by preventive maintenance (PM) operations. Contrary to previous papers considering fixed or/and conservative policies, we explore a case in which PM activities might be postponed or expedited while necessary. Regardi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999